منابع مشابه
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules that can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filt...
متن کاملProof Confluent Tableau Calculi
A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...
متن کاملTableau Calculi for Hybrid Logics
Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quanti ers to bind the labels. Thus, hybrid logics have both Kripke semantics and a rst-order binding apparatus. We present pre xed tableau calculi for weak hybrid l...
متن کاملRule Refinement for Semantic Tableau Calculi
This paper investigates refinement techniques for semantic tableau calculi. The focus is on techniques to reduce branching in inference rules and thus allow more effective ways of carrying out deductions. We introduce an easy to apply, general principle of atomic rule refinement, which depends on a purely syntactic condition that can be easily verified. The refinement has a wide scope, for exam...
متن کاملTableau Calculi for KLM Logics: extended version
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:6)2011